On $$K_{2,t}$$-Bootstrap Percolation
نویسندگان
چکیده
Given two graphs G and H, it is said that percolates in H-bootstrap process if one could join all the nonadjacent pairs of vertices some order such a new copy H created at each step. Balogh, Bollobás Morris 2012 investigated threshold percolation Erdős–Rényi model for complete graph proposed similar problem $$H=K_{s,t}$$ , bipartite graph. In this paper, we provide lower upper bounds on $$K_{2, t}$$ -bootstrap percolation. addition, function derived $$K_{2,4}$$
منابع مشابه
Bootstrap Percolation on Periodic Trees
We study bootstrap percolation with the threshold parameter θ ≥ 2 and the initial probability p on infinite periodic trees that are defined as follows. Each node of a tree has degree selected from a finite predefined set of non-negative integers, and starting from a given node, called root, all nodes at the same graph distance from the root have the same degree. We show the existence of the cri...
متن کاملBootstrap percolation on Gn,p
Bootstrap percolation on a graph G is defined as the spread of activation or infection according to the following rule, with a given threshold r ≥ 2: We start with a set A(0) ⊆ V (G) of active vertices. Each inactive vertex that has at least r active neigbours becomes active. This is repeated until no more vertices become active, i.e., when no inactive vertex has r or more active neigbours. We ...
متن کاملBootstrap percolation on spatial networks
Bootstrap percolation is a general representation of some networked activation process, which has found applications in explaining many important social phenomena, such as the propagation of information. Inspired by some recent findings on spatial structure of online social networks, here we study bootstrap percolation on undirected spatial networks, with the probability density function of lon...
متن کاملLocal Bootstrap Percolation
We study a variant of bootstrap percolation in which growth is restricted to a single active cluster. Initially there is a single active site at the origin, while other sites of Z2 are independently occupied with small probability p, otherwise empty. Subsequently, an empty site becomes active by contact with two or more active neighbors, and an occupied site becomes active if it has an active s...
متن کاملMajority Bootstrap Percolation on G(n, p)
Majority bootstrap percolation on a graph G is an epidemic process defined in the following manner. Firstly, an initially infected set of vertices is selected. Then step by step the vertices that have at least half of its neighbours infected become infected. We say that percolation occurs if eventually all vertices in G become infected. In this paper we provide sharp bounds for the critical siz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2021
ISSN: ['1435-5914', '0911-0119']
DOI: https://doi.org/10.1007/s00373-020-02271-9